Decision Problems for HNN Groups and Vector Addition Systems
نویسندگان
چکیده
منابع مشابه
Reductibilities among Decision Problems for Hnn Groups, Vector Addition Systems and Subsystems of Peano Arithmetic
Our purpose is to exhibit reducibilities among decision problems for conjugate powers in HNN groups, reachability sets of vector addition systems and sentences in subsystems of Peano arithmetic, and show that although these problems are not primitive recursively decidable, they do admit decision procedures which are primitive recursive in the Ackermann function. By the class of vector groups VA...
متن کاملThe Covering and Boundedness Problems for Branching Vector Addition Systems
The covering and boundedness problems for branching vector addition systems are shown complete for doubly-exponential time.
متن کاملUnboundedness problems for languages of vector addition systems
A vector addition system (VAS) with an initial and a final marking and transition labels induces a language. In part because the reachability problem in VAS remains far from being wellunderstood, it is difficult to devise decision procedures for such languages. This is especially true for checking properties that state the existence of infinitely many words of a particular shape. Informally, we...
متن کاملOn Boundedness Problems for Pushdown Vector Addition Systems
We study pushdown vector addition systems, which are synchronized products of pushdown automata with vector addition systems. The question of the boundedness of the reachability set for this model can be refined into two decision problems that ask if infinitely many counter values or stack configurations are reachable, respectively. Counter boundedness seems to be the more intricate problem. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1976
ISSN: 0025-5718
DOI: 10.2307/2005439